Improved distributed local approximation algorithm for minimum 2-dominating set in planar graphs
نویسندگان
چکیده
منابع مشابه
Local Approximability of Minimum Dominating Set on Planar Graphs
We show that there is no deterministic local algorithm (constant-time distributed graph algorithm) that finds a (7 − )-approximation of a minimum dominating set on planar graphs, for any positive constant . In prior work, the best lower bound on the approximation ratio has been 5− ; there is also an upper bound of 52.
متن کاملDistributed Dominating Set Approximations beyond Planar Graphs
The Minimum Dominating Set (MDS) problem is one of the most fundamental and challenging problems in distributed computing. While it is well-known that minimum dominating sets cannot be approximated locally on general graphs, over the last years, there has been much progress on computing local approximations on sparse graphs, and in particular planar graphs. In this paper we study distributed an...
متن کاملImproved Approximation Bounds for Edge Dominating Set in Dense Graphs
We analyze the simple greedy algorithm that iteratively removes the endpoints of a maximum-degree edge in a graph, where the degree of an edge is the sum of the degrees of its endpoints. This algorithm provides a 2-approximation to the minimum edge dominating set and minimum maximal matching problems. We refine its analysis and give an expression of the approximation ratio that is strictly less...
متن کاملMinimum Dominating Set Approximation in Graphs of Bounded Arboricity
Since in general it is NP-hard to solve the minimum dominating set problem even approximatively, a lot of work has been dedicated to central and distributed approximation algorithms on restricted graph classes. In this paper, we compromise between generality and efficiency by considering the problem on graphs of small arboricity a. These family includes, but is not limited to, graphs excluding ...
متن کاملApproximation Algorithm for Minimum Weight Connected m-Fold Dominating Set
Using connected dominating set (CDS) to serve as a virtual backbone in a wireless networks can save energy and reduce interference. Since nodes may fail due to accidental damage or energy depletion, it is desirable that the virtual backbone has some fault-tolerance. A k-connected m-fold dominating set ((k,m)-CDS) of a graph G is a node set D such that every node in V \ D has at least m neighbor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2017
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2016.12.001